A GENETIC ALGORITHM FOR URBAN TRANSIT ROUTING PROBLEM
نویسندگان
چکیده
منابع مشابه
Genetic Algorithm for Biobjective Urban Transit Routing Problem
Genetic algorithm for biobjective urban transit routing problem. The Nottingham ePrints service makes this work by researchers of the University of Nottingham available open access under the following conditions. · To the extent reasonable and practicable the material made available in Nottingham ePrints has been checked for eligibility before being made available. · Copies of full items can be...
متن کاملA genetic algorithm approach for problem
In this paper, a genetic algorithm is presented for an identical parallel-machine scheduling problem with family setup time that minimizes the total weighted flow time ( ). No set-up is necessary between jobs belonging to the same family. A set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i j, the duration of this set-up being the sequ...
متن کاملA realistic perish ability inventory management for location-inventory-routing problem based on Genetic Algorithm
In this paper, it was an attempt to be present a practical perishability inventory model. The proposed model adds using spoilage of products and variable prices within a time period to a recently published location-inventory-routing model in order to make it more realistic. Aforementioned model by integration of strategic, tactical and operational level decisions produces better results for sup...
متن کاملExact and Metaheuristic Algorithms for the Urban Transit Routing Problem
The urban transit routing problem (UTRP) consists of finding satisfying routes for public transportation within a city or region. Urban scenarios get bigger and more complex every day, making the design of routes an overwhelming task whose results are often unsatisfactory, with high costs and travel times. We develop an exact MIP formulation and a multi-objective genetic algorithm to solve this...
متن کاملMetaheuristic methods for the urban transit routing problem
The urban transit routing problem (UTRP) is NP-Hard and involves devising routes for public transport systems. It is a highly complex multiply constrained problem and the evaluation of candidate route sets can prove both time consuming and challenging, with many potential solutions rejected on the grounds of infeasibility. Due to the problem difficulty, metaheuristic algorithms are highly suita...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Modern Physics: Conference Series
سال: 2012
ISSN: 2010-1945,2010-1945
DOI: 10.1142/s2010194512005491